MRDPGA: a multiple restart dynamic population genetic algorithm for scheduling road traffic
نویسندگان
چکیده
Abstract A genetic algorithm is a biologically inspired stochastic approach to finding solutions optimization problems. However, unlike its deterministic counterpart, it cannot guarantee globally optimal solution since may be trapped within local optimum of the search space. Most researchers have focused on proposing new techniques for various parameters algorithms. That mutation, crossover, or selection algorithm. This research proposes modification standard algorithm, which serve as framework that can integrate any these their contribution final The multiple restart dynamic population (MRDPGA) proposed in this was used training adaptive neuro-fuzzy inference system (ANFIS) scheduling road vehicular traffic flows. results ANFIS models based different clustering methods showed MRDPGA-based controller performed better with mean square error (MSE) 0.299 and root (RMSE) 0.547 phase; MSE 0.272 RMSE 0.521 testing phase. Using controllers flow scheduling, MRDPGA-trained terms average waiting time (AWT) minimization total arrived vehicles (TAV). best-performing achieved 50.40% AWT 21.44% TAV improvement. Analyzing using one-tailed t -test paired two-sample means MRDPGA had significant impact controllers. Particularly FCM controller, where ( p = 0.0038) 0.0003) at 95% confidence level. Thus, algorithms are recommended further assessment other problems ascertain performance those problem domains.
منابع مشابه
Restart Scheduling for Genetic Algorithms
In order to escape from local optima, it is standard practice to periodically restart a genetic algorithm according to some restart criteria/policy. This paper addresses the issue of finding a good restart strategy in the context of resource-bounded optimization scenarios, in which the goal is to generate the best possible solution given a fixed amount of time. We propose the use of a restart s...
متن کاملA Genetic Algorithm Developed for a Supply Chain Scheduling Problem
This paper concentrates on the minimization of total tardiness and earliness of orders in an integrated production and transportation scheduling problem in a two-stage supply chain. Moreover, several constraints are also considered, including time windows due dates, and suppliers and vehicles availability times. After presenting the mathematical model of the problem, a developed version of GA c...
متن کاملA genetic algorithm approach for open-pit mine production scheduling
In an Open-Pit Production Scheduling (OPPS) problem, the goal is to determine the mining sequence of an orebody as a block model. In this article, linear programing formulation is used to aim this goal. OPPS problem is known as an NP-hard problem, so an exact mathematical model cannot be applied to solve in the real state. Genetic Algorithm (GA) is a well-known member of evolutionary algorithms...
متن کاملStaff Scheduling by a Genetic Algorithm
This paper describes a Genetic Algorithms approach to amanpower-scheduling problem arising at a Petrochemical Company. AlthoughGenetic Algorithms have been successfully used for similar problemsin the past, they always had to overcome the limitations of theclassical Genetic Algorithms paradigm in handling the conflict betweenobjectives and constraints. The approach taken here is to use an indir...
متن کاملA Genetic Algorithm and a Model for the Resource Constrained Project Scheduling Problem with Multiple Crushable Modes
Abstract: This paper presents an exact model and a genetic algorithm for the multi-mode resource constrained project scheduling problem with generalized precedence relations in which the duration of an activity is determined by the mode selection and the duration reduction (crashing) applied within the selected mode. All resources considered are renewable. The objective is to determine a mode, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Electrical Systems and Information Technology
سال: 2023
ISSN: ['2314-7172']
DOI: https://doi.org/10.1186/s43067-023-00099-w